Skip to content

Utm - #159

Open
crei wants to merge 270 commits into
mainfrom
utm
Open

Utm#159
crei wants to merge 270 commits into
mainfrom
utm

Conversation

@crei

@crei crei commented Apr 10, 2026

Copy link
Copy Markdown
Owner

No description provided.

crei and others added 7 commits April 2, 2026 18:57
Add encodedPos_last_child_succ lemma to TapeView.lean proving that at
the rightEnd of the last child, moving one position right reaches the
parent's rightEnd position.

Use this to prove the ¬h_next branch of right_eval_struct in
Navigation.lean. Also prove h_path and h_head in the path=[] branch.

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
Add encodedPos_next_sibling_succ lemma to TapeView.lean proving that at
the rightEnd of a non-last child, moving one position right reaches
the next sibling's leftEnd position.

Use this to prove the h_next=true branch of right_eval_struct.
The only remaining sorry in right_eval_struct is the root rightEnd case
(path=[], headPos=rightEnd), which depends on ofBiTape? (sorry'd).

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
- Extract sum_map_enc_length_take_succ as reusable helper lemma
- Add toBiTape_move_right_eq to eliminate repeated show/rw pattern
- Inline h_move/h_data/h_enc into single h_update step in right_eval_struct
- Remove redundant comments and combine simp steps
- Net reduction of ~48 lines

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
- Add HeadPos.eq_rightEnd_of_ne_leftEnd simp lemma
- Add toBiTape_comp_update_move_right combining two rewrites
- Delete unused right_of_leftEnd (redundant with right_eval_struct)
- Use new lemmas to simplify right_eval_struct branches

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

4 participants